Making a C6-free graph C4-free and bipartite
نویسندگان
چکیده
منابع مشابه
Making a C6-free graph C4-free and bipartite
Let e(G) denote the number of edges in a graph G, and let Ck denote a k-cycle. It is well-known that every graph has a bipartite subgraph with at least half as many edges. Győri showed that any bipartite, C6-free graph contains a C4-free subgraph containing at least half as many edges. Applying these two results in sequence we see that every C6-free graph, G, has a bipartite C4-free subgraph, H...
متن کاملMaking a K4-free graph bipartite
We show that every K4-free graph G with n vertices can be made bipartite by deleting at most n/9 edges. Moreover, the only extremal graph which requires deletion of that many edges is a complete 3-partite graph with parts of size n/3. This proves an old conjecture of P. Erdős.
متن کاملNote making a K 4-free graph bipartite
The well-known Max Cut problem asks for the largest bipartite subgraph of a graph G. This problem has been the subject of extensive research, both from the algorithmic perspective in computer science and the extremal perspective in combinatorics. Let n be the number of vertices and e be the number edges of G and let b(G) denote the size of the largest bipartite subgraph of G. The extremal part ...
متن کاملC4–free 2-factors in bipartite graphs
D. Hartvigsen [H] recently gave an algorithm to find a C4–free 2–factor in a bipartite graph and using this algorithm he proved several nice theorems. Now we give a simple inductive proof for a generalization of his Tutte-type theorem, and prove the corresponding Ore-type theorem as well. The proof follows the idea of the inductive proof for the Hall’s theorem given by Halmos and Vaughn [HV].
متن کاملVertex partitions of (C3, C4, C6)-free planar graphs
A graph is (k1, k2)-colorable if its vertex set can be partitioned into a graph with maximum degree at most k1 and and a graph with maximum degree at most k2. We show that every (C3, C4, C6)-free planar graph is (0, 6)-colorable. We also show that deciding whether a (C3, C4, C6)-free planar graph is (0, 3)-colorable is NP-complete.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2016
ISSN: 0166-218X
DOI: 10.1016/j.dam.2015.06.008